Non-Binary Message-Passing Algorithms for Magnetic Channels with Data-Dependent Noise
نویسندگان
چکیده
The paper proposes an implementation of the message passing algorithm adapted to iterative channel detection. The algorithm uses soft messages associated to non binary symbols in order to cancel cycles in the equivalent Tanner graphs, achieving optimal performance after a low number of iterations. This architecture, suited to very fast channel detectors, is applied to magnetic recording channels and adapted to the non stationary nature of the magnetic media noise.
منابع مشابه
Graph-based Codes
This is a mini-course on graph-based codes, given at the Center for Theoretical Sciences at Taipei, Taiwan, July 12-15, 2004. In practical coding theory, the main challenge has been to find codes with rates close to channel capacity and with efficient encoding and decoding algorithms. Only recently was this accomplished, theoretically for the binary erasure channel but only experimentally for t...
متن کاملGallager error-correcting codes for binary asymmetric channels
Abstract. We derive critical noise levels for Gallager codes on asymmetric channels as a function of the input bias and the temperature. Using a statistical mechanics approach we study the space of codewords and the entropy in the various decoding regimes. We further discuss the relation of the convergence of the message passing algorithm with the endogenous property and complexity, characteriz...
متن کاملThe Velocity of the Propagating Wave for Spatially Coupled Systems with Applications to LDPC Codes
We consider the dynamics of message passing for spatially coupled codes and, in particular, the set of density evolution equations that tracks the profile of decoding errors along the spatial direction of coupling. It is known that, for suitable boundary conditions and after a transient phase, the error profile exhibits a “solitonic behavior”. Namely, a uniquely-shaped wavelike solution develop...
متن کاملDensity Evolution for Asymmetric Memoryless Channels: The Perfect Projection Condition and the Typicality of the Linear LDPC Code Ensemble
Density evolution is one of the most powerful analytical tools for low-density parity-check (LDPC) codes and graph codes with message passing decoding algorithms. With channel symmetry as one of its fundamental assumptions, density evolution has been widely and successfully applied to different channels, including binary erasure channels, binary symmetric channels, binary additive white Gaussia...
متن کاملStudy of the Sparse Superposition Codes and the Generalized Approximate Message Passing Decoder for the Communication over Binary Symmetric and Z Channels
In this project, the behavior of Generalized Approximate Message-Passing Decoder for BSC and Z Channel is studied using i.i.d matrices for constructing the codewords. The performance of GAMP in AWGN Channel is already evaluated in the previous scientific work of Jean Barbier[1], therefore, this project mainly focuses on the performance of GAMP decoder for BSC and Z Channel. We evaluate the perf...
متن کامل